Instance-Optimal Geometric Algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Instance generating algorithms for MAX2SAT with optimal solutions

Abstract: Instance generating algorithms for MAX2SAT are proposed. The algorithms produce instances with their optimal solutions. We propose two types of algorithms: a constructive one and a randomized one. In the former, nontrivial 2-CNF instances are produced using expander graphs explicitly constructed. On the other hand, in the latter, more complicated instances are produced although it is ...

متن کامل

Instance-by-instance optimal identity testing

We consider the problem of verifying the identity of a distribution: Given the description of a distribution over a discrete support p = (p1, p2, . . . , pn), how many samples (independent draws) must one obtain from an unknown distribution, q, to distinguish, with high probability, the case that p = q from the case that the total variation distance (L1 distance) ||p− q||1 ≥ ε? We resolve this ...

متن کامل

Instance Optimal Learning

We consider the following basic learning task: given independent draws from an unknowndistribution over a discrete support, output an approximation of the distribution that is as ac-curate as possible in `1 distance (equivalently, total variation distance, or “statistical distance”).Perhaps surprisingly, it is often possible to “de-noise” the empirical distribution of the samples<lb...

متن کامل

Instance Search with Weak Geometric Correlation Consistency

Finding object instances from large image collections is a challenging problem with many practical applications. Recent methods inspired by text retrieval achieved good results; however a re-ranking stage based on spatial verification is still required to boost performance. To improve the effectiveness of such instance retrieval systems while avoiding the computational complexity of a re-rankin...

متن کامل

Bayes Optimal Instance-Based Learning

In this paper we present a probabilistic formalization of the instance-based learning approach. In our Bayesian framework, moving from the construction of an explicit hypothesis to a data-driven instance-based learning approach, is equivalent to averaging over all the (possibly innnitely many) individual models. The general Bayesian instance-based learning framework described in this paper can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the ACM

سال: 2017

ISSN: 0004-5411,1557-735X

DOI: 10.1145/3046673